Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
281	On Rank Aggregation of Multiple Orderings in Network Design Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-03-07 16:59:32 Complexity classes Mathematical optimization Structural complexity theory Conjectures Permutation NP Directed acyclic graph Optimization problem Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
282	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
283	Weak sense Lp error bounds for leader–node distributed particle filters Boris N. Oreshkin and Mark Coates Department of Electrical and Computer Engineering McGill University Montreal, Canada Add to Reading List Source URL: www.tsp.ece.mcgill.ca Language: English - Date: 2008-04-18 15:33:02 Control theory Electronic engineering Monte Carlo methods Linear filters Signal processing Particle filter Kalman filter Approximation algorithm Robot control Statistics Estimation theory
284	A Local-Search 2-Approximation for 2-Correlation-Clustering Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: www.mit.edu Language: English - Date: 2012-07-29 14:44:15 NP-complete problems Matroid theory Spanning tree Signed graph Graph Clique Tree Combinatorial optimization Eulerian path Graph theory Theoretical computer science Mathematics
285	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
286	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
287	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Fault Tolerant Clustering Revisited Nirman Kumar∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Approximation algorithms Computational complexity theory Cluster analysis Data mining Geostatistics K-means clustering K-medians clustering Metric k-center Algorithm Mathematics Theoretical computer science Statistics
288	Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-03-29 07:21:24 Operations research Computational complexity theory Convex optimization Linear programming Polyhedron Mathematical optimization Approximation algorithm Simplex algorithm Algorithm Theoretical computer science Applied mathematics Mathematics
289	Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe1 1 Yefim Dinitz2 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:42 Ordinal numbers Logic Ordinal arithmetic Set theory Curry–Howard correspondence Mathematical logic Proof theory Mathematics
290	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems

UPDATE